#define _CRT_SECURE_NO_WARNINGS

#include "Sort.h"

void TestCountSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5,4,1,1,3 };
	CountSort(a, sizeof(a) / sizeof(int));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestQuickSortPlus()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	QuickSortPlus(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestMergeSortNonR()
{
	//int a[] = { 10,6,7,1,3,9,4,2 };
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	MergeSortNonR2(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestMergeSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	MergeSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestQuickSortNonR()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	QuickSortNonR(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestQuickSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	QuickSort(a, 0, sizeof(a) / sizeof(int) - 1);
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestBubbleSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	BubbleSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestSelectSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	SelectSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestHeapSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	HeapSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestShellSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	ShellSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestInsertSort()
{
	int a[] = { 9,1,2,5,7,4,8,6,3,5 };
	InsertSort(a, sizeof(a) / sizeof(a[0]));
	PrintA(a, sizeof(a) / sizeof(a[0]));
}
void TestOP()
{
	srand(time(0));
	const int N = 10000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);


	if (a1 == NULL || a2 == NULL || a3 == NULL || a4 == NULL || a5 == NULL || a6 == NULL || a7 == NULL || a8 == NULL)
	{
		perror("malloc fail");
		exit(-1);
	}
	for (int i = 0; i < N; i++)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];
	}
	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	HeapSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	//SelectSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	//BubbleSort(a5, N);
	int end5 = clock();

	int begin6 = clock();
	QuickSortNonR(a6, 0, N - 1);
	int end6 = clock();

	int begin7 = clock();
	MergeSort(a7, N);
	int end7 = clock();

	int begin8 = clock();
	CountSort(a8, N);
	int end8 = clock();

	printf("%d\n", end1 - begin1);
	printf("%d\n", end2 - begin2);
	printf("%d\n", end3 - begin3);
	printf("%d\n", end4 - begin4);
	printf("%d\n", end5 - begin5);
	printf("%d\n", end6 - begin6);
	printf("%d\n", end7 - begin7);
	printf("%d\n", end8 - begin8);



	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
	free(a8);
}
int main()
{
	TestOP();
	//TestHeapSort();
	//TestSelectSort();
	//TestOP();
	//TestBubbleSort();
	//TestQuickSort();
	//TestQuickSortNonR();
	//TestMergeSort();
	//TestMergeSortNonR();
	//TestQuickSortPlus();
	//TestCountSort();
	return 0;
}